Indecomposable factorizations of multigraphs
نویسندگان
چکیده
منابع مشابه
Factorizations of complete multigraphs
In this paper, several general results are obtained on the Oberwolfach problem that provide isomorphic 2-factorizations of 2Kn. One consequence of these results is that the existence of a 2-factorization in which each 2-factor of 2Kn consists of one cycle of length x and one of length n-x is completely settled. The techniques used to obtain these results are novel, using for example the Lindner...
متن کاملExcessive factorizations of bipartite multigraphs
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2, . . . , Fr} of 1-factors of G whose union is E(G) and, subject to this condition, r is minimum. The integer r is called the excessive index of G and denoted by χ′e(G). Analogously, let m be a positive integer. We say...
متن کاملDegree-bounded factorizations of bipartite multigraphs and of pseudographs
For d ≥ 1, s ≥ 0 a (d,d + s)-graph is a graph whose degrees all lie in the interval {d,d +1, . . . ,d +s}. For r ≥ 1, a≥ 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of G. An (r,r+a)-factorization of a graph G is a decomposition of G into edge-disjoint (r,r +a)-factors. We prove a number of results about (r,r+a)-factorizations of (d,d+s)-bipartite multigraphs and of (d,d + s)...
متن کاملIndecomposable Polytopes
The space of summands (with respect to vector addition) of a convex polytope in n dimensions is studied. This space is shown to be isomorphic to a convex pointed cone in Euclidean space. The extreme rays of this cone correspond to similarity classes of indecomposable polytopes. The decomposition of a polytope is described and a bound is given for the number of indecomposable summands needed. A ...
متن کاملDegree sequences of multigraphs
Let a, b and n be integers, n ≥ 1 and b ≥ a ≥ 0. Let an (a, b, n)-graph defined as a loopless graph G(a, b, n) on n vertices {V1, . . . , Vn}, in which Vi and Vj are connected with at least a and at most b (directed or undirected) edges. If G(a, b, n) is directed, then it is called (a, b, n)-digraph and if it is undirected, then it is called (a, b, n)undigraph. Landau in 1953 published an algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90158-1